On functional logic programming and its application to testing
نویسنده
چکیده
ion, 5, 6, 8, 13, 15, 108, 152advancing strategy, 43anonymous function, 7approximation, 10assembly language, 5assignment, 5AVL tree, 69 backtracking, 21, 29, 108, 110, 115balanced strategy, 43binary leaf tree, 14black-box tests, 35, 68Boolean values, 1breadth-first search, 29, 42, 116 call-time choice, 25, 124, 128, 132, 135class constraint, 12code coverage, 77call coverage, 80, 90criterion, 77, 104rule coverage, 79code reuse, 9, 10, 13, 15, 21, 33complete strategy, 43computational effect, 108constraints, 30equality, 20finite domain, 31constructor, 1continuation, 113, 146control flow, 79, 88, 104core language, 93Curry, 1, 19currying, 8 data flow, 81, 86, 90, 104data type, 1declarative programming, 5def-use chain, 82, 84, 86, 90, 91depth-bound search, 65depth-first search, 29, 42, 108diagonalisation, 48difference list, 111, 115discrepancy search, 65diverging computation, 9do-notation, 16, 27, 59dynamic programming, 73 equational reasoning, 13, 14, 18, 35,131evaluation order, 6explicit sharing, 124, 127, 128expression coverage, 78 failure, 20failure continuation, 115fair predicates, 67free variable, see logic variablefunction, 1function application, 7function composition, 7, 15functional logic programming, 19functional programming, 6functor, 13 generate-and-test, 25, 123, 125glass-box tests, 35, 60, 68, 77 Haskell, 1head-normal form, 85heap, 39, 51, 69heap sort, 69higher-order function, 7, 73, 84, 95, 99 infinite data structure, 10, 125, 131input/output, 16IO monad, 16iterative deepening search, 43, 118iterative sampling, 75
منابع مشابه
Lightweight Testing of Curry Programs
We shine a light on practical aspects of logic features in functional languages. Free variables, nondeterminism and encapsulated search turn out to be elegant and powerful means to express test-data generation. We present a lightweight, automated tool for specificationbased testing of declarative programs written in the functional logic programming language Curry and emphasize the usefulness of...
متن کاملA Fast and Self-Repairing Genetic Programming Designer for Logic Circuits
Usually, important parameters in the design and implementation of combinational logic circuits are the number of gates, transistors, and the levels used in the design of the circuit. In this regard, various evolutionary paradigms with different competency have recently been introduced. However, while being advantageous, evolutionary paradigms also have some limitations including: a) lack of con...
متن کاملDesigning the Application of Verbal Fluency Test in Persian for Neurocognitive Evaluations
Verbal fluency test is a useful method to evaluate cognitive executive functions. Studies have shown that both types of verbal fluency test (phonemic and semantic) are influenced by brain damage. This test is rarely used by clinicians because it takes too much time to perform. Therefore, we decided to increase its speed and accuracy by designing a verbal fluency test application in Persian lang...
متن کاملLogic regression and its application in predicting diseases
Regression is one of the most important statistical tools in data analysis and study of the relationship between predictive variables and the response variable. in most issues, regression models and decision tress only can show the main effects of predictor variables on the response and considering interactions between variables does not exceed of two way and ultimately three-way, due to co...
متن کاملCurry without Success
Curry is a successful, general-purpose, functional logic programming language that predefines a singleton type Success explicitly to support its logic component. We take the likely-controversial position that without Success Curry would be as much logic or more. We draw a short history and motivation for the existence of this type and justify why its elimination could be advantageous. Furthermo...
متن کاملA constraint-based partial evaluator for functional logic programs and its application
The aim of this work is the development and application of a partial evaluation procedure for rewriting-based functional logic programs. Functional logic programming languages unite the two main declarative programming paradigms. The rewriting-based computational model extends traditional functional programming languages by incorporating logical features, including logical variables and built-i...
متن کامل